Strict Finitism and the Happy Sorites Ofra Magidor [Penultimate draft of paper forthcoming in Journal of Philosophical Logic Please cite the published version] Abstract: Call an argument a ‘happy sorites’ if it is a

Source URL: users.ox.ac.uk

Theory and Applications of Categories, Vol. 7, No. 15, 2000, pp. 284–338. GEOMETRIC AND HIGHER ORDER LOGIC IN TERMS OF ABSTRACT STONE DUALITY PAUL TAYLOR Transmitted by Robert Rosebrugh

Source URL: www.tac.mta.ca

FIFTY YEARS OF THE SPECTRUM PROBLEM: SURVEY AND NEW RESULTS A. DURAND, N. D. JONES, J. A. MAKOWSKY, AND M. MORE Abstract. In 1952, Heinrich Scholz published a question in the Journal of Symbolic Logic asking for a chara

Source URL: www.diku.dk

Coala: A Compiler from Action Languages to ASP Martin Gebser, Torsten Grote, and Torsten Schaub? Universit¨at Potsdam, Institut f¨ur Informatik, August-Bebel-Str. 89, DPotsdam Abstract. Action languages allow fo

Source URL: www.cs.uni-potsdam.de

• Logic programming
• Answer set programming
• ASCII
• Coala
• Linear temporal logic
• Stable model semantics

Towards Logic Functions as the Device Prasad Shabadi, Alexander Khitun, Pritish Narayanan, Mingqiang Bao, Israel Koren, Kang L. Wang and C. Andras Moritz Abstract - This paper argues for alternate state variables and new

Source URL: euler.ecs.umass.edu

A Refined Tableau Calculus with Controlled Blocking for the Description Logic SHOI Mohammad Khodadadi, Renate A. Schmidt, and Dmitry Tishkovsky? School of Computer Science, The University of Manchester, UK Abstract The

Source URL: ceur-ws.org

Intuitionistic Mathematics and Realizability in the Physical World Andrej Bauer University of Ljubljana January 18, 2012 Abstract

Source URL: math.andrej.com

• Constructivism
• Logic
• Mathematics
• Abstraction
• Realizability
• Intuitionistic logic
• Infinitesimal
• Interpretation
• BrouwerHeytingKolmogorov interpretation
• Intuitionism
• Calculus
• Negation

Probabilistic Logic with Conditional Independence Formulae Magdalena Ivanovska and Martin Giese1 Abstract. We investigate a probabilistic propositional logic that is an extension of the logic proposed by Fagin et al. [4]

Source URL: heim.ifi.uio.no

Verifying an Open Compiler Using Multi-Language Semantics James T. Perconti and Amal Ahmed Northeastern University Abstract. Existing verified compilers are proved correct under a closed-world assumption, i.e., that the

Source URL: www.ccs.neu.edu

• Logic
• Theoretical computer science
• Automated theorem proving
• Logic programming
• Logical truth
• Propositional calculus
• Substitution
• Mathematical logic
• Security type system
• Symbol

Hybrid Logic and ‘Now’ (Extended Abstract) Patrick Blackburn and Klaus Frovin Jørgensen Department for Philosophy and Science Studies Roskilde University

Source URL: conference.prior.aau.dk